Evaluation of connected-component labeling algorithms for distributed-memory systems
نویسندگان
چکیده
منابع مشابه
Evaluation of connected-component labeling algorithms for distributed-memory systems
Connected component labeling is a key step in a wide-range of applications, such as community detection in social networks and coherent structure identification in massivelyparallel scientific simulations. There have been several distributed-memory connected component algorithms described in literature; however, little has been done regarding their scalability analysis. Theoretical and experime...
متن کاملOptimizing Connected Component Labeling Algorithms
This paper presents two new strategies that can be used to greatly improve the speed of connected component labeling algorithms. To assign a label to a new object, most labeling algorithms use a scanning step that examines some of its neighbors. The first strategy exploits the dependencies among the neighbors to reduce the number of neighbors examined. When considering 8-connected components in...
متن کاملOptimal component labeling algorithms for mesh-connected computers and VLSI
Given an undirected graph G of n weighted edges, stored one edge per processor in a square mesh of n processors, we show how to determine the connected components and a minimal spanning forest in Θ( √ n) time. More generally, we show how to solve these problems in Θ(n1/d) time when the mesh is a d-dimensional cube, where the implied constants depend upon d.
متن کاملConnected Component Labeling Algorithms for Gray-Scale Images and Evaluation of Performance using Digital Mammograms
The main goal of this paper is to compare performance of connected component labeling algorithms on grayscale digital mammograms. This study was carried out as a part of a research for improving efficiency and accuracy of diagnosing breast cancer using digital mammograms. Three connected component labeling algorithms developed by Jung-Me Park [8], Kenji Suzuki [16] and Kesheng Wu [9], were used...
متن کاملA Comparative Review of Two-Pass Connected Component Labeling Algorithms
In this paper, we show a comparative review of Connected Component Labeling (CCL) methods, focused in two-pass variants, including their elements and implementation issues. We analyze the main elements used by these CCL algorithms and their importance for the performance of the methods using them. We present some experiments using a complex image set and evaluating the performance of each algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Parallel Computing
سال: 2015
ISSN: 0167-8191
DOI: 10.1016/j.parco.2015.02.005